The challenge of axonal path-finding.
نویسنده
چکیده
Congenital syndromes of altered nervous system connectivity are reviewed along with recent findings on axonal growth: achiasma, congenital nystagmus, congenital horizontal gaze palsy, mirror movements and the syndromes of Kallmann, Wildervanck, Duane and Marcus Gunn. Identical guidance molecules are most likely involved in making axonal connections after injury and during development. Thus, investigations into variants of connectivity may help develop strategies to treat disconnections of axons in the adult.
منابع مشابه
A Branch and Bound Method for Finding Flow Path Designing of Agv Systems (RESEARCH NOTE)
One of the important factor in the design of automated guided vehicle systems (AGVS) is the flow path design. This paper presents a branch-and-bound algorithm to determining the flow path by considering not only loaded-vehicles, but also empty-vehicles. The objective is to find the flow path, which will minimize total travel of loaded vehicles. We know that in branch-and-bound method a branch c...
متن کاملTwo optimal algorithms for finding bi-directional shortest path design problem in a block layout
In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...
متن کاملInvestigating the relationship between intelligence believes and academic dishonesty: mediating role af academic challenge.
Introduction: Academic dishonesty has spread widely among students in different countries, which has led to adverse consequences in the field of education in different societies. ¬ Gray was an academic challenge. Methods: The research was correlational and path analysis. The statistical population of the study consisted of all students of Ahvaz University in the academic year of 1996-97, in whi...
متن کاملFinding the Optimal Path to Restoration Loads of Power Distribution Network by Hybrid GA-BCO Algorithms Under Fault and Fuzzy Objective Functions with Load Variations
In this paper proposes a fuzzy multi-objective hybrid Genetic and Bee colony optimization algorithm(GA-BCO) to find the optimal restoration of loads of power distribution network under fault.Restoration of distribution systems is a complex combinatorial optimization problem that should beefficiently restored in reasonable time. To improve the efficiency of restoration and facilitate theactivity...
متن کاملFinding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms
The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Strabismus
دوره 14 2 شماره
صفحات -
تاریخ انتشار 2006